Diversifying Query Suggestion Results.

Smooth Optimization for Effective Multiple Kernel Learning.


UserRec A User Recommendation Framework in Social Tagging Systems.


Online learning for multi%2Dtask feature selection.

Sentomist Unveiling Transient Sensor Network Bugs via Symptom Mining.

Simple and Efficient Multiple Kernel Learning by Group Lasso.
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of the kernel weights is solved by complicated techniques, such as Semi-infinite Linear Programming, Gradient Descent, or Level method; (2) the maximization of SVM dual variables can be solved by standard SVM solvers. However, the minimization step in these methods is usually dependent on its solving techniques or commercial softwares, which therefore limits the efficiency and applicability. In this paper, we formulate a closed-form solution for optimizing the kernel weights based on the equivalence between group-lasso and MKL. Although this equivalence is not our invention, our derived variant equivalence not only leads to an efficient algorithm for MKL, but also generalizes to the case for Lp-MKL (p ≥ 1 and denoting the Lp-norm of kernel weights). Therefore, our proposed algorithm provides a unified solution for the entire family of Lp-MKL models. Experiments on multiple data sets show the promising performance of the proposed technique compared with other competitive methods. 1.
Online Learning for Group Lasso.
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional batch-mode group lasso algorithms, which suffer from the inefficiency and poor scalability, our proposed algorithm performs in an online mode and scales well: at each iteration one can update the weight vector according to a closed-form solution based on the average of previous subgradients. Therefore, the proposed online algorithm can be very efficient and scalable. This is guaranteed by its low worst-case time complexity and memory cost both in the order of O(d), where d is the number of dimensions. Moreover, in order to achieve more sparsity in both the group level and the individual feature level, we successively extend our online system to efficiently solve a number of variants of sparse group lasso models. We also show that the online system is applicable to other group lasso models, such as the group lasso with overlap and graph lasso. Finally, we demonstrate the merits of our algorithm by experimenting with both synthetic and real-world datasets. 1.
Collaborative reliability prediction of service%2Doriented systems.

Distributed QoS Evaluation for Real%2DWorld Web Services.

WSExpress A QoS%2Daware Search Engine for Web Services.

FTCloud A Component Ranking Framework for Fault%2DTolerant Cloud Applications.

CloudRank A QoS%2DDriven Component Ranking Framework for Cloud Computing.

Introduction to social recommendation.

A delay%2Daware reliable event reporting framework for wireless sensor%2Dactuator networks.


An adaptive QoS%2Daware fault tolerance strategy for web services.


Optimal Fault Tolerance Strategy Selection for Web Services.

Automatic string test data generation for detecting domain errors.

A social recommendation framework based on multi%2Dscale continuous conditional random fields.

Enhancing expertise retrieval using community%2Daware strategies.%
Current search technologies work in &#034;one size fits all&#034; fashion. Therefore, the answer to a query is independent of specific user information need. In this paper, we describe a novel ranking technique for personalized search services that combines content-based and community-based evidences. The community-based information is used in order to provide context for queries and is influenced by the current interaction of the user with the service. Our algorithm is evaluated using data derived from an actual service available on the Web, an online bookstore. We show that the quality of content-based ranking strategies can be improved by the use of community information as another evidential source of relevance. In our experiments, the improvements reach up to 48% in terms of average precision.
MatchSim a novel neighbor%2Dbased similarity measure with maximum neighborhood matching.

Enhancing expertise retrieval using community%2Daware strategies.%
Current search technologies work in &#034;one size fits all&#034; fashion. Therefore, the answer to a query is independent of specific user information need. In this paper, we describe a novel ranking technique for personalized search services that combines content-based and community-based evidences. The community-based information is used in order to provide context for queries and is influenced by the current interaction of the user with the service. Our algorithm is evaluated using data derived from an actual service available on the Web, an online bookstore. We show that the quality of content-based ranking strategies can be improved by the use of community information as another evidential source of relevance. In our experiments, the improvements reach up to 48% in terms of average precision.
TagRec Leveraging Tagging Wisdom for Recommendation.

Nonrigid shape recovery by Gaussian process regression.

A QoS%2Daware fault tolerant middleware for dependable service composition.

Non%2Dmonotonic feature selection.
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinatorial optimization problem, and is usually solved by an approximation. Conventional feature selection methods address the computational challenge in two steps: (a) ranking all the features by certain scores that are usually computed independently from the number of specified features m, and (b) selecting the top m ranked features. One major shortcoming of these approaches is that if a feature f is chosen when the number of specified features is m, it will always be chosen when the number of specified features is larger than m. We refer to this property as the “monotonic ” property of feature selection. In this work, we argue that it is important to develop efficient algorithms for non-monotonic feature selection. To this end, we develop an algorithm for non-monotonic feature selection that approximates the related combinatorial optimization problem by a Multiple Kernel Learning (MKL) problem. We also present a strategy that derives a discrete solution from the approximate solution of MKL, and show the performance guarantee for the derived discrete solution when compared to the global optimal solution for the related combinatorial optimization problem. An empirical study with a number of benchmark data sets indicates the promising per-
Test selection for result inspection via mining predicate rules.
It is labor-intensive to manually verify the outputs of a large set of tests that are not equipped with test oracles. Test selection helps to reduce this cost by selecting a small subset of tests that are likely to reveal faults. A promising approach is to dynamically mine operational models as potential test oracles and then select tests that violate them. Existing work mines operational models from verified passing tests based on dynamic invariant detection. In this paper, we propose to mine common operational models, which are not always true in all observed traces, from a set of unverified tests based on mining predicate rules. Specifically, we collect values of simple predicates at runtime and then generate and evaluate predicate rules as potential operational models after running all the tests. We then select tests that violate the mined predicate rules for result inspection. Preliminary results on the Siemens suite and the grep program show the effectiveness of our approach. 1.
WSRec A Collaborative Filtering Based Web Service Recommender System.

WSRec A Collaborative Filtering Based Web Service Recommender System.



Supervised Self%2Dtaught Learning Actively transferring knowledge from unlabeled data.

A generalized Co%2DHITS algorithm and its application to bipartite graphs.

A Coalitional Game Model for Heat Diffusion Based Incentive Routing and Forwarding Scheme.
Abstract. We propose an incentive routing and forwarding scheme that integrates a reputation system into a monetary payment mechanism to encourage nodes cooperation in wireless ad hoc networks. For the first time in the literature, we build our reputation system based on a heat diffusion model. The heat diffusion model provides us a way of combining the direct and indirect reputation together and propagating the reputation from locally to globally. Further, we model and analyze our incentive scheme using a coalitional game, which is not the usual non-cooperative game like others. We further prove that under a proper condition this game has a non-empty stable core. From the evaluation we can see that the cumulative utility of nodes increases when nodes stay in the core. Keywords: Coalitional Game, Incentive Routing, Heat Diffusion. 1
Learning to recommend with trust and distrust relationships.

Learning to recommend with social trust ensemble.
As an indispensable technique in the field of Information Filtering, Recommender System has been well studied and developed both in academia and in industry recently. However, most of current recommender systems suffer the following problems: (1) The large-scale and sparse data of the user-item matrix seriously affect the recommendation quality. As a result, most of the recommender systems cannot easily deal with users who have made very few ratings. (2) The traditional recommender systems assume that all the users are independent and identically distributed; this assumption ignores the connections among users, which is not consistent with the real world recommendations. Aiming at modeling recommender systems more accurately and realistically, we propose a novel probabilistic factor analysis framework, which naturally fuses the users ’ tastes and their trusted friends ’ favors together. In this framework, we coin the term Social Trust Ensemble to represent the formulation of the social trust restrictions on the recommender systems. The complexity analysis indicates that our approach can be applied to very large datasets since it scales linearly with the number of observations, while the experimental results show that our method performs better than the state-of-theart approaches.
Entropy%2Dbiased models for query representation on the click graph.

Effective latent space graph%2Dbased re%2Dranking model with global consistency.

Semisupervised SVM batch mode active learning with applications to image retrieval.

Batch Mode Active Learning with Applications to Text Categorization and Image Retrieval.
Abstract—Most machine learning tasks in data classification and information retrieval require manually labeled data examples in the training stage. The goal of active learning is to select the most informative examples for manual labeling in these learning tasks. Most of the previous studies in active learning have focused on selecting a single unlabeled example in each iteration. This could be inefficient, since the classification model has to be retrained for every acquired labeled example. It is also inappropriate for the setup of information retrieval tasks where the user’s relevance feedback is often provided for the top K retrieved items. In this paper, we present a framework for batch mode active learning, which selects a number of informative examples for manual labeling in each iteration. The key feature of batch mode active learning is to reduce the redundancy among the selected examples such that each example provides unique information for model updating. To this end, we employ the Fisher information matrix as the measurement of model uncertainty, and choose the set of unlabeled examples that can efficiently reduce the Fisher information of the classification model. We apply our batch mode active learning framework to both text categorization and image retrieval. Promising results show that our algorithms are significantly more effective than the active learning approaches that select unlabeled examples based only on their informativeness for the classification model. Index Terms—Batch mode active learning, logistic regressions, kernel logistic regressions, convex optimization, text categorization, image retrieval. Ç 1
On Sensor Network Reconfiguration for Downtime%2DFree System Migration.
Abstract Many state-of-the-art wireless sensor networks have been equipped with reprogramming modules, e.g., those for software/firmware updates. System migration tasks such as software reprogramming, however, will interrupt normal sensing and data processing operations of a sensor node. Although such tasks are occasionally invoked, the long time of such tasks may disable the network from detecting critical events, posing a severe threat to many sensitive applications. In this paper, we present the first formal study on the problem of downtime-free migration. We demonstrate that the downtime can be effectively eliminated, by partitioning the sensors into subsets, and let them perform migration tasks successively with the rest still performing normal services. We then present a series of effective algorithms, and further extend our solution The work was substantially supported by a grant from the
Arbitrary Norm Support Vector Machines.

A novel kernel%2Dbased maximum a posteriori classification method.


Localized support vector regression for time series prediction.


Near%2Dduplicate keyframe retrieval by nonrigid image matching.

Dynamic Web Service Composition A New Approach in Building Reliable Web Service.

Semi%2Dsupervised text categorization by active search.

Mining social networks using heat diffusion processes for marketing candidates selection.
Social Network Marketing techniques employ pre-existing social networks to increase brands or products awareness through word-of-mouth promotion. Full understanding of social network marketing and the potential candidates that can thus be marketed to certainly offer lucrative opportunities for prospective sellers. Due to the complexity of social networks, few models exist to interpret social network marketing realistically. We propose to model social network marketing using Heat Diffusion Processes. This paper presents three diffusion models, along with three algorithms for selecting the best individuals to receive marketing samples. These approaches have the following advantages to best illustrate the properties of real-world social networks: (1) We can plan a marketing strategy sequentially in time since we include a time factor in the simulation of product adoptions; (2) The algorithm of selecting marketing candidates best represents and utilizes the clustering property of real-world social networks; and (3) The model we construct can diffuse both positive and negative comments on products or brands in order to simulate the complicated communications within social networks. Our work represents a novel approach to the analysis of social network marketing, and is the first work to propose how to defend against negative comments within social networks. Complexity analysis shows our model is also scalable to very large social networks.
Learning latent semantic relations from clickthrough data for query suggestion.
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to the complexity of the Web structure and the ambiguity of users ’ inputs, most of the suggestion algorithms suffer from the problem of poor recommendation accuracy. In this paper, aiming at providing semantically relevant queries for users, we develop a novel, effective and efficient two-level query suggestion model by mining clickthrough data, in the form of two bipartite graphs (user-query and query-URL bipartite graphs) extracted from the clickthrough data. Based on this, we first propose a joint matrix factorization method which utilizes two bipartite graphs to learn the low-rank query latent feature space, and then build a query similarity graph based on the features. After that, we design an online ranking algorithm to propagate similarities on the query similarity graph, and finally recommend latent semantically relevant queries to users. Experimental analysis on the clickthrough data of a commercial search engine shows the effectiveness and the efficiency of our method.
SoRec social recommendation using probabilistic matrix factorization.
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system confronts. Many existing approaches to recommender systems can neither handle very large datasets nor easily deal with users who have made very few ratings or even none at all. Moreover, traditional recommender systems assume that all the users are independent and identically distributed; this assumption ignores the social interactions or connections among users. In view of the exponential growth of information generated by online social networks, social network analysis is becoming important for many Web applications. Following the intuition that a person’s social network will affect personal behaviors on the Web, this paper proposes a factor analysis approach based on probabilistic matrix factorization to solve the data sparsity and poor prediction accuracy problems by employing both users ’ social network information and rating records. The complexity analysis indicates that our approach can be applied to very large datasets since it scales linearly with the number of observations, while the experimental results shows that our method performs much better than the state-of-the-art approaches, especially in the circumstance that users have made few or no ratings.
Semi%2Dsupervised SVM batch mode active learning for image retrieval.
Active learning has been shown as a key technique for improving content-based image retrieval (CBIR) performance. Among various methods, support vector machine (SVM) active learning is popular for its application to relevance feedback in CBIR. However, the regular SVM active learning has two main drawbacks when used for relevance feedback. First, SVM often suffers from learning with a small number of labeled examples, which is the case in relevance feedback. Second, SVM active learning usually does not take into account the redundancy among examples, and therefore could select multiple examples in relevance feedback that are similar (or even identical) to each other. In this paper, we propose a novel scheme that exploits both semi-supervised kernel learning and batch mode active learning for relevance feedback in CBIR. In particular, a kernel function is first learned from a mixture of labeled and unlabeled examples. The kernel will then be used to effectively identify the informative and diverse examples for active learning via a min-max framework. An empirical study with relevance feedback of CBIR showed that the proposed scheme is significantly more effective than other state-of-the-art approaches. 1.
WS%2DDREAM A distributed reliability assessment Mechanism for Web Services.
It is critical to guarantee the reliability of serviceoriented applications. This is because they may employ remote Web Services as components, which may easily become unavailable in the unpredictable Internet environment. This practical experience report presents a Distribute REliability Assessment Mechanism for Web Services (WS-DREAM), allowing users to carry out Web Services reliability assessment in a collaborative manner. With WS-DREAM, users in different geography locations help each other to carry out testing, and share test cases under the coordination of a centralized server. Based on this collaborative mechanism, reliability assessment for Web Services in real environment from different locations of the world becomes seamless. To illustrate the advantage of this mechanism, a prototype is implemented and a case study is carried out. Users from five locations all over the world perform reliability assessment to Web Services distributed in six countries. Over 1,000,000 test cases are executed in a collaborative manner and detailed results are provided. 1.
An Effective Approach to 3D Deformable Surface Tracking.

A Novel Coalitional Game Model for Security Issues in Wireless Networks.

An Index%2DBased Sensor%2DGrouping Mechanism for Efficient Field%2DCoverage Wireless Sensor Networks.

Formal Models for Expert Finding on DBLP Bibliography Data.

Semi%2Dsupervised Learning from General Unlabeled Data.
We consider the problem of Semi-supervised Learning (SSL) from general unlabeled data, which may contain irrelevant samples. Within the binary setting, our model manages to better utilize the information from unlabeled data by formulating them as a three-class (−1, +1, 0) mixture, where class 0 represents the irrelevant data. This distinguishes our work from the traditional SSL problem where unlabeled data are assumed to contain relevant samples only, either +1 or −1, which are forced to be the same as the given labeled samples. This work is also different from another family of popular models, universum learning (universum means “irrelevant ” data), in that the universum need not to be specified beforehand. One significant contribution of our proposed framework is that such irrelevant samples can be automatically detected from the available unlabeled data, even though they are mixed with relevant data. This hence presents a general SSL framework that does not force “clean ” unlabeled data. More importantly, we formulate this general learning framework as a Semidefinite Programming problem, making it solvable in polynomial time. A series of experiments demonstrate that the proposed framework can outperform the traditional SSL on both synthetic and real data. 1
Direct Zero%2DNorm Optimization for Feature Selection.

Maximal%2DRobustness%2DMinimal%2DFragility Controller A Compromise between Robustness and Fragility of Biochemical Networks.

Voronoi%2DBased Sleeping Configuration in Wireless Sensor Networks with Location Error.

A Distributed Replication Strategy Evaluation and Selection Framework for Fault Tolerant Web Services.

Efficient Minimax Clustering Probability Machine by Generalized Probability Product Kernel.

Anything You Want to Ask about Software Reliability Engineering.

Learning with Consistency between Inductive Functions and Kernels.
Regularized Least Squares (RLS) algorithms have the ability to avoid over-fitting problems and to express solutions as kernel expansions. However, we observe that the current RLS algorithms cannot provide a satisfactory interpretation even on a constant function. On the other hand, while kernel-based algorithms have been developed in such a tendency that almost all learning algorithms are kernelized or being kernelized, a basic fact is often ignored: The learned function from the data and the kernel fits the data well, but may not be consistent with the kernel. Based on these considerations and on the intuition that a good kernel-based inductive function should be consistent with both the data and the kernel, a novel learning scheme is proposed. The advantages of this scheme lie in its corresponding Representer Theorem, its strong interpretation ability about what kind of functions should not be penalized, and its promising accuracy improvements shown in a number of experiments. Furthermore, we provide a detailed technical description about heat kernels, which serves as an example for the readers to apply similar techniques for other kernels. Our work provides a preliminary step in a new direction to explore the varying consistency between inductive functions and kernels under various distributions. 1
A QoS%2DAware Middleware for Fault Tolerant Web Services.

An Extended Level Method for Efficient Multiple Kernel Learning.

Learning with Consistency between Inductive Functions and Kernels.
Regularized Least Squares (RLS) algorithms have the ability to avoid over-fitting problems and to express solutions as kernel expansions. However, we observe that the current RLS algorithms cannot provide a satisfactory interpretation even on a constant function. On the other hand, while kernel-based algorithms have been developed in such a tendency that almost all learning algorithms are kernelized or being kernelized, a basic fact is often ignored: The learned function from the data and the kernel fits the data well, but may not be consistent with the kernel. Based on these considerations and on the intuition that a good kernel-based inductive function should be consistent with both the data and the kernel, a novel learning scheme is proposed. The advantages of this scheme lie in its corresponding Representer Theorem, its strong interpretation ability about what kind of functions should not be penalized, and its promising accuracy improvements shown in a number of experiments. Furthermore, we provide a detailed technical description about heat kernels, which serves as an example for the readers to apply similar techniques for other kernels. Our work provides a preliminary step in a new direction to explore the varying consistency between inductive functions and kernels under various distributions. 1
Face Annotation Using Transductive Kernel Fisher Discriminant.
Abstract—Face annotation in images and videos enjoys many potential applications in multimedia information retrieval. Face annotation usually requires many training data labeled by hand in order to build effective classifiers. This is particularly challenging when annotating faces on large-scale collections of media data, in which huge labeling efforts would be very expensive. As a result, traditional supervised face annotation methods often suffer from insufficient training data. To attack this challenge, in this paper, we propose a novel Transductive Kernel Fisher Discriminant (TKFD) scheme for face annotation, which outperforms traditional supervised annotation methods with few training data. The main idea of our approach is to solve the Fisher’s discriminant using deformed kernels incorporating the information of both labeled and unlabeled data. To evaluate the effectiveness of our method, we have conducted extensive experiments on three types of multimedia testbeds: the FRGC benchmark face dataset, the Yahoo! web image collection, and the TRECVID video data collection. The experimental results show that our TKFD algorithm is more effective than traditional supervised approaches, especially when there are very few training data. Index Terms—Face annotation, image annotation, kernel Fisher discriminant, multimedia information retrieval, supervised learning, transductive kernel Fisher discriminant, transductive learning. I.
Maxi%2DMin Margin Machine Learning Large Margin Classifiers Locally and Globally.
Abstract — We propose a novel large margin classifier, called the Maxi-Min Margin Machine (M 4). This model learns the decision boundary both locally and globally. In comparison, other large margin classifiers construct separating hyperplanes only either locally or globally. For example, a state-of-the-art large margin classifier, the Support Vector Machine (SVM), considers data only locally, while another significant model, the Minimax Probability Machine (MPM), focuses on building the decision hyperplane exclusively based on the global information. As a major contribution, we show that SVM yields the same solution as M 4 when data satisfy certain conditions, and MPM can be regarded as a relaxation model of M 4. Moreover, based on our proposed local and global view of data, another popular model, the Linear Discriminant Analysis, can easily be interpreted and extended as well. We describe the M 4 model definition, provide a geometrical interpretation, present theoretical justifications, and propose a practical sequential conic programming method to solve the optimization problem. We also show how to exploit Mercer kernels to extend M 4 for nonlinear classifications. Furthermore, we perform a series of evaluations on both synthetic data sets and real world benchmark data sets. Comparison with SVM and MPM demonstrates the advantages of our new model. Index Terms — classification, large margin, kernel methods, second order cone programming, learning locally and globally I.
Progressive Finite Newton Approach To Real%2Dtime Nonrigid Surface Detection.
Detecting nonrigid surfaces is an interesting research problem for computer vision and image analysis. One important challenge of nonrigid surface detection is how to register a nonrigid surface mesh having a large number of free deformation parameters. This is particularly significant for detecting nonrigid surfaces from noisy observations. Nonrigid surface detection is usually regarded as a robust parameter estimation problem, which is typically solved iteratively from a good initialization in order to avoid local minima. In this paper, we propose a novel progressive finite Newton optimization scheme for the nonrigid surface detection problem, which is reduced to only solving a set of linear equations. The key of our approach is to formulate the nonrigid surface detection as an unconstrained quadratic optimization problem which has a closed-form solution for a given set of observations. Moreover, we employ a progressive active-set selection scheme, which takes advantage of the rank information of detected correspondences. We have conducted extensive experiments for performance evaluation on various environments, whose promising results show that the proposed algorithm is more efficient and effective than the existing iterative methods. 1.
Robust Regularized Kernel Regression.

A study of regularized Gaussian classifier in high%2Ddimension small sample set case based on MDL principle with application to spectrum recognition.

A Multi%2DScale Tikhonov Regularization Scheme for Implicit Surface Modelling.
Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape models from large-scale sets of point cloud samples efficiently. In this paper, we propose a fast solution for approximating implicit surfaces based on a multi-scale Tikhonov regularization scheme. The optimization of our scheme is formulated into a sparse linear equation system, which can be efficiently solved by factorization methods. Different from traditional approaches, our scheme does not employ auxiliary off-surface points, which not only saves the computational cost but also avoids the problem of injected noise. To further speedup our solution, we present a multi-scale surface fitting algorithm of coarse to fine modelling. We conduct comprehensive experiments to evaluate the performance of our solution on a number of datasets of different scales. The promising results show that our suggested scheme is considerably more efficient than the stateof-the-art approach. 1.
Progressive Finite Newton Approach To Real%2Dtime Nonrigid Surface Detection.
Detecting nonrigid surfaces is an interesting research problem for computer vision and image analysis. One important challenge of nonrigid surface detection is how to register a nonrigid surface mesh having a large number of free deformation parameters. This is particularly significant for detecting nonrigid surfaces from noisy observations. Nonrigid surface detection is usually regarded as a robust parameter estimation problem, which is typically solved iteratively from a good initialization in order to avoid local minima. In this paper, we propose a novel progressive finite Newton optimization scheme for the nonrigid surface detection problem, which is reduced to only solving a set of linear equations. The key of our approach is to formulate the nonrigid surface detection as an unconstrained quadratic optimization problem which has a closed-form solution for a given set of observations. Moreover, we employ a progressive active-set selection scheme, which takes advantage of the rank information of detected correspondences. We have conducted extensive experiments for performance evaluation on various environments, whose promising results show that the proposed algorithm is more efficient and effective than the existing iterative methods. 1.
LOFT A Latency%2DOriented Fault Tolerant Transport Protocol for Wireless Sensor%2DActuator Networks.

Software Reliability Engineering A Roadmap.
participated in more than 30 industrial projects, published over 250 papers, and helped to develop many commercial systems and software tools. Professor Lyu is frequently invited as a keynote or tutorial speaker to conferences and workshops in U.S., Europe, and
LOFT A Latency%2DOriented Fault Tolerant Transport Protocol for Wireless Sensor%2DActuator Networks.

An Empirical Study on Large%2DScale Content%2DBased Image Retrieval.
One key challenge in content-based image retrieval (CBIR) is to develop a fast solution for indexing high-dimensional image contents, which is crucial to building large-scale CBIR systems. In this paper, we propose a scalable content-based image retrieval scheme using locality-sensitive hashing (LSH), and conduct extensive evaluations on a large image testbed of a half million images. To the best of our knowledge, there is less comprehensive study on large-scale CBIR evaluation with a half million images. Our empirical results show that our proposed solution is able to scale for hundreds of thousands of images, which is promising for building web-scale CBIR systems. 1
Learning nonparametric kernel matrices from pairwise constraints.
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Some kernel learning methods assume the target kernel matrix to be a linear combination of parametric kernel matrices. This assumption again importantly limits the flexibility of the target kernel matrices. The key challenge with nonparametric kernel learning arises from the difficulty in linking the nonparametric kernels to the input patterns. In this paper, we resolve this problem by introducing the graph Laplacian of the observed data as a regularizer when optimizing the kernel matrix with respect to the pairwise constraints. We formulate the problem into Semi-Definite Programs (SDP), and propose an efficient algorithm to solve the SDP problem. The extensive evaluation on clustering with pairwise constraints shows that the proposed nonparametric kernel learning method is more effective than other state-of-the-art kernel learning techniques. 1.
Kernel Maximum a Posteriori Classification with Error Bound Analysis.

ReliableWeb Services Methodology%2C Experiment and Modeling.
We identify parameters impacting Web services dependability, describe the methods of dependability enhancement by redundancy in space and redundancy in time, and perform a series of experiments to evaluate the availability of Web services. To increase the availability of Web services, we employ several replication schemes and compare them with a single service. The Web services are coordinated by a replication manager. It provides a round robin algorithm for scheduling the workload of the Web services and keeps updating the availability of each Web service. The replication algorithm and the detailed system configuration are described. Experiments are performed to evaluate the resulting service availability. Modeling on the Web services with Petri-net is constructed and verified through experiments with different applications. With the parameters obtained from the experiments, the proposed model can be engaged to demonstrate the characteristics of the Web service. 1.
Two%2Dstage Multi%2Dclass AdaBoost for Facial Expression Recognition.

Maximum Margin based Semi%2Dsupervised Spectral Kernel Learning.
Abstract — Semi-supervised kernel learning is attracting increasing research interests recently. It works by learning an embedding of data from the input space to a Hilbert space using both labeled data and unlabeled data, and then searching for relations among the embedded data points. One of the most well-known semi-supervised kernel learning approaches is the spectral kernel learning methodology which usually tunes the spectral empirically or through optimizing some generalized performance measures. However, the kernel designing process does not involve the bias of a kernel-based learning algorithm, the deduced kernel matrix cannot necessarily facilitate a specific learning algorithm. To supplement the spectral kernel learning methods, this paper proposes a novel approach, which not only learns a kernel matrix by maximizing another generalized performance measure, the margin between two classes of data, but also leads directly to a convex optimization method for learning the margin parameters in support vector machines. Moreover, experimental results demonstrate that our proposed spectral kernel learning method achieves promising results against other spectral kernel learning methods. I.

Software Reliability Modeling with Test Coverage Experimentation and Measurement with A Fault%2DTolerant Software Project.


A Survey of Fault Tolerant CORBA Systems.

Effective missing data prediction for collaborative filtering.

DiffusionRank a possible penicillin for web spamming.

Web page classification with heterogeneous data fusion.

Extending Link%2Dbased Algorithms for Similar Web Pages with Neighborhood Structure.

A hybrid particle swarm optimization%2Dback%2Dpropagation algorithm for feedforward neural network training.

A hierarchical mixture model for software reliability prediction.

An efficient intruder detection algorithm against sinkhole attacks in wireless sensor networks.

An Assessment of Testing%2DEffort Dependent Software Reliability Growth Models.

Feature Selection Based on Minimum Error minimax Probability Machine.

The generalized dependency degree between attributes.
Inspired by the dependency degree �, a traditional measure in Rough Set Theory, we propose a generalized dependency degree, �, between two given sets of attributes, which counts both deterministic and indeterministic rules while � counts only deterministic rules. We first give its definition in terms of equivalence relations and then interpret it in terms of minimal rules, and further describe the algorithm for its computation. To understand � better, we investigate its various properties. We further extend � to incomplete information systems. To show its advantage, we make a comparative study with the conditional entropy and � in a number of experiments. Experimental results show that the speed of the new C4.5 using � is greatly improved when compared with the original C4.5R8 using conditional entropy, while the prediction accuracy and tree size of the new C4.5 are comparable with the original one. Moreover,  � achieves better results on attribute selection than �. The study shows that the generalized dependency degree is an informative measure in decision trees and in attribute selection.
Extraction and segmentation of tables from Chinese ink documents based on a matrix model.

Learning Distance Metrics with Contextual Constraints for Image Retrieval.
Relevant Component Analysis (RCA) has been proposed for learning distance metrics with contextual constraints for image retrieval. However, RCA has two important disadvantages. One is the lack of exploiting negative constraints which can also be informative, and the other is its incapability of capturing complex nonlinear relationships between data instances with the contextual information. In this paper, we propose two algorithms to overcome these two disadvantages, i.e., Discriminative Component Analysis (DCA) and Kernel DCA. Compared with other complicated methods for distance metric learning, our algorithms are rather simple to understand and very easy to solve. We evaluate the performance of our algorithms on image retrieval in which experimental results show that our algorithms are effective and promising in learning good quality distance metrics for image retrieval. 1
Real%2DTime Non%2Drigid Shape Recovery Via Active Appearance Models for Augmented Reality.
Abstract. One main challenge in Augmented Reality (AR) applications is to keep track of video objects with their movement, orientation, size, and position accurately. This poses a challenging task to recover nonrigid shape and global pose in real-time AR applications. This paper proposes a novel two-stage scheme for online non-rigid shape recovery toward AR applications using Active Appearance Models (AAMs). First, we construct 3D shape models from AAMs offline, which do not involve processing of the 3D scan data. Based on the computed 3D shape models, we propose an efficient online algorithm to estimate both 3D pose and non-rigid shape parameters via local bundle adjustment for building up point correspondences. Our approach, without manual intervention, can recover the 3D non-rigid shape effectively from either real-time video sequences or single image. The recovered 3D pose parameters can be used for AR registrations. Furthermore, the facial feature can be tracked simultaneously, which is critical for many face related applications. We evaluate our algorithms on several video sequences. Promising experimental results demonstrate our proposed scheme is effective and significant for real-time AR applications.
Adaptive Nearest Neighbor Classifier Based on Supervised Ellipsoid Clustering.

Gene Selection Based on Mutual Information for the Classification of Multi%2Dclass Cancer.

Constructing Robust and Resilient Framework for Cooperative Video Streaming.

Batch mode active learning and its application to medical image classification.
The goal of active learning is to select the most informative examples for manual labeling. Most of the previous studies in active learning have focused on selecting a single unlabeled example in each iteration. This could be inefficient since the classification model has to be retrained for every labeled example. In this paper, we present a framework for “batch mode active learning ” that applies the Fisher information matrix to select a number of informative examples simultaneously. The key computational challenge is how to efficiently identify the subset of unlabeled examples that can result in the largest reduction in the Fisher information. To resolve this challenge, we propose an efficient greedy algorithm that is based on the property of submodular functions. Our empirical studies with five UCI datasets and one realworld medical image classification show that the proposed batch mode active learning algorithm is more effective than the state-ofthe-art algorithms for active learning. 1.
Spectrum Analysis Based onWindows with Variable Widths for Online Signature Verification.

Local Support Vector Regression for Financial Time Series Prediction.

Predictive Random Graph Ranking on the Web.
Abstract — The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by formulating a new framework called, Predictive Random Graph Ranking, in which we generate a random graph based on the known information about the Web structure. The random graph can be considered as the predicted Web structure, on which ranking algorithm are expected to be improved in accuracy. For this purpose, we extend some current ranking algorithms from a static graph to a random graph. Experimental results show that the Predictive Random Graph Ranking framework can improve the accuracy of the ranking algorithms such as PageRank, Common Neighbor, and Jaccard’s Coefficient. I.
Making Services Fault Tolerant.
Abstract. With ever growing use of Internet, Web services become increasingly popular and their growth rate surpasses even the most optimistic predictions. Services are self-descriptive, self-contained, platformindependent and openly-available components that interact over the network. They are written strictly according to open specifications and/or standards and provide important and often critical functions for many business-to-business systems. Failures causing either service downtime or producing invalid results in such systems may range from a mere inconvenience to significant monetary penalties or even loss of human lives. In applications where sensing and control of machines and other devices take place via services, making the services highly dependable is one of main critical goals. Currently, there is no experimental investigation to evaluate the reliability and availability of Web services systems. In this paper, we identify parameters impacting the Web services dependability, describe the methods of dependability enhancement by redundancy in space and redundancy in time and perform a series of experiments to evaluate the availability of Web services. To increase the availability of the Web service, we use several replication schemes and compare them with a single service. The Web services are coordinated by a replication manager. The replication algorithm and the detailed system configuration are described in this paper.
Nonlinear Blind Source Separation Using Hybrid Neural Networks.

A New Learning Algorithm for Function Approximation Incorporating A Priori Information into Extreme Learning Machine.

A point%2Ddistribution index and its application to sensor%2Dgrouping in wireless sensor networks.
Abstract — We propose ι, a novel index for evaluation of pointdistribution. ι is the minimum distance between each pair of points normalized by the average distance between each pair of points. We find that a set of points that achieve a maximum value of ι result in a honeycomb structure. We propose that ι can serve as a good index to evaluate the distribution of the points, which can be employed in coverage-related problems in wireless sensor networks (WSNs). To validate this idea, we formulate a general sensor-grouping problem for WSNs and provide a general sensing model. We show that locally maximizing ι at sensor nodes is a good approach to solve this problem with an algorithm called Maximizing-ι Node-Deduction (MIND). Simulation results verify that MIND outperforms a greedy algorithm that exploits sensorredundancy we design. This demonstrates a good application of employing ι in coverage-related problems for WSNs. I.
Learning the unified kernel machines for classification.

A Framework for Inheritance Testing from VDM   Specifications.

An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks Description and Security Evaluation.

ART augmented reality table for interactive trading card game.

PageSim a novel link%2Dbased measure of web page aimilarity.

Time%2Ddependent semantic similarity measure of queries using historical click%2Dthrough data.
It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of clickthrough data logged by Web search engines, which record the interactions between users and the search engines. Most existing approaches employ the click-through data for similarity measure of queries with little consideration of the temporal factor, while the click-through data is often dynamic and contains rich temporal information. In this paper we present a new framework of time-dependent query semantic similarity model on exploiting the temporal characteristics of historical click-through data. The intuition is that more accurate semantic similarity values between queries can be obtained by taking into account the timestamps of the log data. With a set of user-defined calendar schema and calendar patterns, our time-dependent query similarity model is constructed using the marginalized kernel technique, which can exploit both explicit similarity and implicit semantics from the click-through data effectively. Experimental results on a large set of click-through data acquired from a commercial search engine show that our time-dependent query similarity model is more accurate than the existing approaches. Moreover, we observe that our time-dependent query similarity model can, to some extent, reflect real-world semantics such as real-world events that are happening over time.
Large%2Dscale text categorization by batch mode active learning.
Large-scale text categorization is an important research topic for Web data mining. One of the challenges in large-scale text categorization is how to reduce the human efforts in labeling text documents for building reliable classification models. In the past, there have been many studies on applying active learning methods to automatic text categorization, which try to select the most informative documents for manually labeling. Most of these studies focused on selecting a single unlabeled document in each iteration. As a result, the text categorization model has to be retrained after each labeled document is solicited. In this paper, we present a novel active learning algorithm that selects a batch of text documents for manually labeling in each iteration. The key of the batch mode active learning is how to reduce the redundancy among the selected examples such that each example provides unique information for model updating. To this end, we use the Fisher information matrix as the measurement of model uncertainty and choose the set of documents that can efficiently minimize the Fisher information matrix of a classification model. Extensive experiments with three different datasets have shown that our algorithm is more effective than the state-of-the-art active learning techniques for text categorization and can be a promising tool toward large-scale text categorization on World Wide Web.
PageSim A Novel Link%2DBased Similarity Measure for the World Wide Web.

A Unified Log%2DBased Relevance Feedback Scheme for Image Retrieval.
Abstract—Relevance feedback has emerged as a powerful tool to boost the retrieval performance in content-based image retrieval (CBIR). In the past, most research efforts in this field have focused on designing effective algorithms for traditional relevance feedback. Given that a CBIR system can collect and store users ’ relevance feedback information in a history log, an image retrieval system should be able to take advantage of the log data of users ’ feedback to enhance its retrieval performance. In this paper, we propose a unified framework for log-based relevance feedback that integrates the log of feedback data into the traditional relevance feedback schemes to learn effectively the correlation between low-level image features and high-level concepts. Given the error-prone nature of log data, we present a novel learning technique, named Soft Label Support Vector Machine, to tackle the noisy data problem. Extensive experiments are designed and conducted to evaluate the proposed algorithms based on the COREL image data set. The promising experimental results validate the effectiveness of our log-based relevance feedback scheme empirically. Index Terms—Content-based image retrieval, relevance feedback, log-based relevance feedback, log data, user issues, semantic gap, support vector machines.
Incorporating fault debugging activities into software reliability models a simulation approach.

Extraction of Line Segments and Circular Arcs From Freehand Strokes Based on Segmental Homogeneity Features.

A modified learning algorithm incorporating additional functional constraints into neural networks.

Collaborative image retrieval via regularized metric learning.
In content-based image retrieval (CBIR), relevant images are identified based on their similarities to query images. Most CBIR algorithms are hindered by the semantic gap between the low-level image features used for computing image similarity and the high-level semantic concepts conveyed in images. One way to reduce the semantic gap is to utilize the log data of users ’ feedback that has been collected by CBIR systems in history, which is also called “collaborative image retrieval”. In this paper, we present a novel metric learning approach, named “regularized metric learning”, for collaborative image retrieval, which learns a distance metric by exploring the correlation between low-level image features and the log data of users ’ relevance judgments. Compared to the previous research, a regularization mechanism is used in our algorithm to effectively prevent overfitting. Meanwhile, we formulate the proposed learning algorithm into a semi-definite programming problem, which can be solved very efficiently by existing software packages and is scalable to the size of log data. An extensive set of experiments has been conducted to show that the new algorithm can substantially improve the retrieval accuracy of a baseline CBIR system using Euclidean distance metric, even with a modest amount of log data. The experiment also indicates that the new algorithm is more effective and more efficient than
A novel adaptive sequential niche technique for multimodal function optimization.

Nonnegative independent component analysis based on minimizing mutual information technique.

The effect of code coverage on fault detection under different testing profiles.
Software testing is a key procedure to ensure high quality and reliability of software programs. The key issue in software testing is the selection and evaluation of different test cases. Code coverage has been proposed to be an estimator for testing effectiveness, but it remains a controversial topic which lacks of support from empirical data. In this study, we hypothesize that the estimation of code coverage on testing effectiveness varies under different testing profiles. To evaluate the performance of code coverage, we employ coverage testing and mutation testing in our experiment to investigate the relationship between code coverage and fault detection capability under different testing profiles. From our experimental data, code coverage is simply a moderate indicator for the capability of fault detection on the whole test set. However, it is clearly a good estimator for the fault detection of exceptional test cases, but a poor one for test cases in normal operations. For other testing profiles, such as functional testing and random testing, the correlation between code coverage and fault coverage is higher in functional test than in random testing, although these different testing profiles are complementary in the whole test set. The effects of different coverage metrics are also addressed in our experiment. Categories and Subject Descriptors D.2.5 [Software Engineering]: Testing and Debugging— testing tools (e.g., data generators, coverage testing); D.2.8
CUHK at ImageCLEF 2005 Cross%2DLanguage and Cross%2DMedia Image Retrieval.
Abstract. In this paper, we describe our studies of cross-language and cross-media image retrieval at the ImageCLEF 2005. This is the first participation of our CUHK (The Chinese University of Hong Kong) group at ImageCLEF. The task in which we participated is the “bilingual ad hoc retrieval ” task. There are three major focuses and contributions in our participation. The first is the empirical evaluation of language models and smoothing strategies for cross-language image retrieval. The second is the evaluation of cross-media image retrieval, i.e., combining text and visual contents for image retrieval. The last is the evaluation of bilingual image retrieval between English and Chinese. We provide an empirical analysis of our experimental results, in which our approach achieves the best mean average precision result in the monolingual query task in the campaign. Finally we summarize our empirical experience and address the future improvement of our work. 1
A Semi%2DSupervised Active Learning Framework for Image Retrieval.
Although recent studies have shown that unlabeled data are beneficial to boosting the image retrieval performance, very few approaches for image retrieval can learn with labeled and unlabeled data effectively. This paper proposes a novel semi-supervised active learning framework comprising a fusion of semi-supervised learning and support vector machines. We provide theoretical analysis of the active learning framework and present a simple yet effective active learning algorithm for image retrieval. Experiments are conducted on real-world color images to compare with traditional methods. The promising experimental results show that our proposed scheme significantly outperforms the previous approaches. 1.
A New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception.

Integrating User Feedback Log into Relevance Feedback by Coupled SVM for Content%2DBased Image Retrieval.
Relevance feedback has been shown as an important tool to boost the retrieval performance in content-based image retrieval. In the past decade, various algorithms have been proposed to formulate relevance feedback in contentbased image retrieval. Traditional relevance feedback techniques mainly carry out the learning tasks by focusing lowlevel visual features of image content with little consideration on log information of user feedback. However, from a long-term learning perspective, the user feedback log is one of the most important resources to bridge the semantic gap problem in image retrieval. In this paper we propose a novel technique to integrate the log information of user feedback into relevance feedback for image retrieval. Our algorithm’s construction is based on a coupled support vector machine which learns consistently with the two types of information: the low-level image content and the user feedback log. We present a mathematical formulation of the problem and develop a practical algorithm to solve the problem effectively. Experimental results show that our proposed scheme is effective and promising. 1.
Methods of Decreasing the Number of Support Vectors via k%2DMean Clustering.

Improvements to the Conventional Layer%2Dby%2DLayer BP Algorithm.

PORT A Price%2DOriented Reliable Transport Protocol for Wireless Sensor Networks.
In wireless sensor networks, to obtain reliability and minimize energy consumption, a dynamic rate-control and congestion-avoidance transport scheme is very important. We notice that reporting packets may contribute to the sink’s fidelity of its knowledge on the phenomenon of interest to different extents. Thus, reliability cannot simply be measured by the sink’s total incoming packet rate as considered in current schemes. Also, communication costs between sources and the sink may be different and may change dynamically. Based on these considerations, we propose PORT (Price-Oriented Reliable Transport protocol) to facilitate the sink to achieve reliability. Under the constraint that the sink must obtain enough fidelity for reliability purpose, PORT minimizes energy consumption with two schemes. One is based on the sink’s application-based optimization approach that feeds back the optimal reporting rates. The other is a locally optimal routing scheme according to the feedback of downstream communication conditions. PORT can adapt well to the communication conditions for energy saving while maintaining the necessary level of reliability. Simulation results in an application case study demonstrate the effectiveness of PORT. 1.
PORT A Price%2DOriented Reliable Transport Protocol for Wireless Sensor Networks.
In wireless sensor networks, to obtain reliability and minimize energy consumption, a dynamic rate-control and congestion-avoidance transport scheme is very important. We notice that reporting packets may contribute to the sink’s fidelity of its knowledge on the phenomenon of interest to different extents. Thus, reliability cannot simply be measured by the sink’s total incoming packet rate as considered in current schemes. Also, communication costs between sources and the sink may be different and may change dynamically. Based on these considerations, we propose PORT (Price-Oriented Reliable Transport protocol) to facilitate the sink to achieve reliability. Under the constraint that the sink must obtain enough fidelity for reliability purpose, PORT minimizes energy consumption with two schemes. One is based on the sink’s application-based optimization approach that feeds back the optimal reporting rates. The other is a locally optimal routing scheme according to the feedback of downstream communication conditions. PORT can adapt well to the communication conditions for energy saving while maintaining the necessary level of reliability. Simulation results in an application case study demonstrate the effectiveness of PORT. 1.
Semantic Video Summarization Using Mutual Reinforcement Principle and Shot Arrangement Patterns.

An Experimental Evaluation on Reliability Features of N%2DVersion Programming.
Although N-version programming has been employed in some mission-critical applications, the reliability and fault correlation issues remain a debatable topic in the research community. In this paper, we perform a comprehensive evaluation on our recent project data on N-version programming and present statistical investigations on coincident failures and correlated faults. Furthermore, we compare our project with NASA 4-University project to identify the “variants ” and “invariants ” with respect to failure rate, fault density, coincident failures, related faults, and reliability improvement for N-version programming. Our experimental results support fault tolerance as an effective software reliability engineering technique. Keywords: N-version programming, fault correlation, reliability, software fault tolerance, empirical study 1
A Novel Method for Early Software Quality Prediction Based on Support Vector Machine.

Semantic Video Summarization Using Mutual Reinforcement Principle and Shot Arrangement Patterns.

Predictive ranking a novel page ranking approach by estimating the web structure.
PageRank (PR) is one of the most popular ways to rank web pages. However, as the Web continues to grow in volume, it is becoming more and more di#cult to crawl all the available pages. As a result, the page ranks computed by PR are only based on a subset of the whole Web. This produces inaccurate outcome because of the inherent incomplete information (dangling pages) that exist in the calculation. To overcome this incompleteness, we propose a new variant of the PageRank algorithm called, Predictive Ranking (PreR), in which di#erent classes of dangling pages are analyzed individually so that the link structure can be predicted more accurately. We detail our proposed steps. Furthermore, experimental results show that this algorithm achieves encouraging results when compared with previous methods.
The effect of code coverage on fault detection under different testing profiles.
Software testing is a key procedure to ensure high quality and reliability of software programs. The key issue in software testing is the selection and evaluation of different test cases. Code coverage has been proposed to be an estimator for testing effectiveness, but it remains a controversial topic which lacks of support from empirical data. In this study, we hypothesize that the estimation of code coverage on testing effectiveness varies under different testing profiles. To evaluate the performance of code coverage, we employ coverage testing and mutation testing in our experiment to investigate the relationship between code coverage and fault detection capability under different testing profiles. From our experimental data, code coverage is simply a moderate indicator for the capability of fault detection on the whole test set. However, it is clearly a good estimator for the fault detection of exceptional test cases, but a poor one for test cases in normal operations. For other testing profiles, such as functional testing and random testing, the correlation between code coverage and fault coverage is higher in functional test than in random testing, although these different testing profiles are complementary in the whole test set. The effects of different coverage metrics are also addressed in our experiment. Categories and Subject Descriptors D.2.5 [Software Engineering]: Testing and Debugging— testing tools (e.g., data generators, coverage testing); D.2.8
A novel scheme for hybrid digital video watermarking approach
Abstract—We have seen an explosion of data exchange in the Internet and the extensive use of digital media. Consequently, digital data owners can quickly and massively transfer multimedia documents across the Internet. This leads to wide interest in multimedia security and multimedia copyright protection. We propose a novel hybrid digital video watermarking scheme based on the scene change analysis and error correction code. Our video watermarking algorithm is robust against the attacks of frame dropping, averaging and statistical analysis, which were not solved effectively in the past. We start with a complete survey of current watermarking technologies, and noticed that none of the existing schemes is capable of resisting all attacks. Accordingly, we propose the idea of embedding different parts of a single watermark into different scenes of a video. We then analyze the strengths of different watermarking schemes, and apply a hybrid approach to form a super watermarking scheme that can resist most of the attacks. To increase the robustness of the scheme, the watermark is refined by an error correcting code, while the correcting code is embedded as a watermark in the audio channel. It optimizes the quality of the watermarked video. The effectiveness of this scheme is verified through a series of experiments, in which a number of standard image processing attacks are conducted, and the robustness of our approach is demonstrated using the criteria of the latest StirMark test. Index Terms—Digital watermarking, discrete wavelet transform (DWT), hybrid, scene change, video. I.
A comprehensive method for multilingual video text detection

A Simulation Approach to Structure%2DBased Software Reliability Analysis.

Reliability analysis for various communication schemes in wireless CORBA.

Optimal release time for software systems considering cost

Optimal testing resource allocation
Abstract—We consider two kinds of software testing-resource allocation problems. The first problem is to minimize the number of remaining faults given a fixed amount of testing-effort, and a reliability objective. The second problem is to minimize the amount of testing-effort given the number of remaining faults, and a reliability objective. We have proposed several strategies for module testing to help software project managers solve these problems, and make the best decisions. We provide several systematic solutions based on a nonhomogeneous Poisson process model, allowing systematic allocation of a specified amount of testing-resource expenditures for each software module under some constraints. We describe several numerical examples on the optimal testing-resource allocation problems to show applications &amp; impacts of the proposed strategies during module testing. Experimental results indicate the advantages of the approaches we proposed in guiding software engineers &amp; project managers toward best testing resource allocation in practice. Finally, an extensive sensitivity analysis is presented to investigate the effects of various principal parameters on the optimization problem of testing-resource allocation. The results can help us know which parameters have the most significant influence, and the changes of optimal testing-effort expenditures affected by the variations of fault detection rate &amp; expected initial faults. Index Terms—Non-homogeneous Poisson processes, sensitivity analysis, software reliability, testing resource allocation.
Recognition of merged characters based on forepart prediction

Reliability assessment and sensitivity analysis of software reliability growth modeling based on software module structure.

A Hough transform based line recognition method utilizing both parameter space and image space.

A novel log%2Dbased relevance feedback technique in content%2Dbased image retrieval.
Relevance feedback has been proposed as an important technique to boost the retrieval performance in content-based image retrieval (CBIR). However, since there exists a semantic gap between low-level features and high-level semantic concepts in CBIR, typical relevance feedback techniques need to perform a lot of rounds of feedback for achieving satisfactory results. These procedures are time-consuming and may make the users bored in the retrieval tasks. For a long-term study purpose in CBIR, we notice that the users’ feedback logs can be available and employed for helping the retrieval tasks in CBIR systems. In this paper, we propose a novel scheme to study the log-based relevance feedback (LRF) technique for improving retrieval performance and reducing the semantic gap in CBIR. In order to effectively incorporate the users ’ feedback logs, we propose a modified support vector machine (SVM) technique called soft label support vector machine (SLSVM) to construct the LRF algorithm in CBIR. We conduct extensive experiments to evaluate the performance of our proposed algorithm. Compared with the typical approach using query expansion (QEX) technique, we demonstrate that our proposed scheme can significantly improve the retrieval performance of semantic image retrieval from detailed experiments.
Biased Minimax Probability Machine for Medical Diagnosis.
The Minimax Probability Machine (MPM) constructs a classifier, which provides a worst-case bound on the  probability of misclassification of future data points based on reliable estimates of means and covariance matrices of  the classes from the training data points, and achieves the comparative performance with a state-of-the-art classifier,  the Support Vector Machine. In this paper, we eliminate the assumption of the unbiased weight for each class in  the MPM and develop a critical extension, named Biased Minimax Probability Machine (BMPM), to deal with  biased classification tasks, especially in the medical diagnostic applications. We outline the theoretical derivatives  of the BMPM. Moreover, we demonstrate that this model can be transformed into a concave-convex Fractional  Programming (FP) problem or a pseudoconcave problem. After illustrating our model with a synthetic dataset and  applying it to the real-world medical diagnosis datasets, we obtain encouraging and promising experimental results.
Software Reliability Growth Models Incorporating Fault Dependency with Various Debugging Time Lags.

Learning Classifiers from Imbalanced Data Based on Biased Minimax Probability Machine.
We consider the problem of the binary classification on imbalanced data, in which nearly all the instances are labelled as one class, while far fewer instances are labelled as the other class, usually the more important class. Traditional machine learning methods seeking an accurate performance over a full range of instances are not suitable to deal with this problem, since they tend to classify all the data into the majority, usually the less important class. Moreover, some current methods have tried to utilize some intermediate factors, e.g., the distribution of the training set, the decision thresholds or the cost matrices, to influence the bias of the classification. However, it remains uncertain whether these methods can improve the performance in a systematic way. In this paper, we propose a novel model named Biased Minimax Probability Machine. Different from previous methods, this model directly controls the worst-case real accuracy of classification of the future data to build up biased classifiers. Hence, it provides a rigorous treatment on imbalanced data. The experimental results on the novel model comparing with those of three competitive methods, i.e., the Naive Bayesian classifier, the k-Nearest Neighbor method, and the decision tree method C4.5, demonstrate the superiority of our novel model. 1
Integrating Trust in Grid Computing Systems.

Trust%2D and Clustering%2DBased Authentication Services in Mobile Ad Hoc Networks.
A mobile ad hoc network is a kind of wireless communication network that does not rely on a fixed infrastructure and is lack of any centralized control. These characteristics make it vulnerable to security attack, so protecting the security of the network is essential. Like many distributed systems, security in ad hoc networks widely relies on the use of key management mechanisms. However, traditional key management systems are not appropriate for them. This work aims at providing a secure and distributed authentication service in ad hoc networks. We propose a secure public key authentication service based on our trust model and network model to prevent nodes from obtaining false public keys of the others when there are malicious nodes in the network. We perform an overall evaluation of our proposed approach by simulations. The experimental results indicate clear advantages of our approach in providing effective security in mobile ad hoc networks. 1.
Robust face recognition using minimax probability machine.

Video summarization by video structure analysis and graph optimization.
graph optimization
Learning large margin classifiers locally and globally.
A new large margin classifier, named MaxiMin  Margin Machine (M    )isproposedin  this paper. This new classifier is constructed  based on both a &#034;local&#034; and a &#034;global&#034; view  of data, while the most popular large margin  classifier, Support Vector Machine (SVM)  and the recently-proposed important model,  Minimax Probability Machine (MPM) consider  data only either locally or globally. This  new model is theoretically important in the  sense that SVM and MPM can both be considered  as its special case. Furthermore, the  optimization of M    can be cast as a sequential  conic programming problem, which can  be solved e#ciently. We describe the M    model definition, provide a clear geometrical  interpretation, present theoretical justifications,  propose e#cient solving methods,  and perform a series of evaluations on both  synthetic data sets and real world benchmark  data sets. Its comparison with SVM and  MPM also demonstrates the advantages of  our new model.
Outliers Treatment in Support Vector Regression for Financial Time Series Prediction.
Abstract. Recently, the Support Vector Regression (SVR) has been applied in the financial time series prediction. The financial data are usually highly noisy and contain outliers. Detecting outliers and deflating their influence are important but hard problems. In this paper, we propose a novel “two-phase ” SVR training algorithm to detect outliers and reduce their negative impact. Our experimental results on three indices: Hang Seng Index, NASDAQ, and FSTE 100 index show that the proposed “two-phase ” algorithm has improvement on the prediction. 1
Group%2Dbased Relevance Feedback with Support Vector Machine Ensembles.

Video summarization by spatial%2Dtemporal graph optimization.

An Empirical Study on Reliability Modeling for Diverse Software Systems.
Reliability and fault correlation are two main concerns for design diversity, yet empirical data are limited in investigating these two. In previous work, we conducted a software project with real-world application for investigation on software testing and fault tolerance for design diversity. Mutants were generated by injecting one single real fault recorded in the software development phase to the final versions. In this paper, we perform more analysis and experiments on these mutants to evaluate and investigate the reliability features in diverse software systems. We apply our project data on two different reliability models and estimate the reliability bounds for evaluation purpose. We also parameterize fault correlations to predict the reliability of various combinations of versions, and compare three different fault-tolerant software architectures. 1
Optimal Allocation of Testing%2DResource Considering Cost

Expected%2DReliability Analysis for Wireless CORBA with Imperfect Components.
Reliability analysis has long been an important area of research for wired networks. However, little reliability analysis has been conducted on wireless networks. Wireless networks, such as wireless CORBA, inherit the unique handoff characteristic which leads to different communication structures with various types and numbers of components and links. Therefore, the traditional definition of two-terminal reliability is not applicable anymore. We propose a new term, two-terminal expected-reliability, to integrate those different communication structures into one metric, which includes not only the failure parameters but also the service parameters. Nevertheless, the two-terminal expected-reliability is still a monotonicallydecreasing function of time t. The expected-reliability and the corresponding MTTF are evaluated quantitatively in different communication schemes. To observe the gains in reliability improvement, the reliability importances of imperfect components are also evaluated. The results show that the failure parameters of different components take different effects on the MTTF and on the reliability importance. With different expected working times of a system, the focus of reliability improvement should be transferred to different components. Although our analysis is conducted on wireless CORBA platforms, it is extensible to generic wireless network systems.
The powerrank web link analysis algorithm.
{byzhang, zhengc,
Affinity rank a new scheme for efficient web search.
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative documents. In this paper, we propose two new metrics to evaluate the performance of information retrieval: diversity, which measures the topic coverage of a group of documents, and information richness, which measures the amount of information contained in a document. Then we present a novel ranking scheme, Affinity Rank, which utilizes these two metrics to improve search results. We demonstrate how Affinity Rank works by a toy data set, and verify our method by experiments on real-world data sets.
Copyright protection on the web a hybrid digital video watermarking scheme.
Video is one of the most popular data shared in the Web, and the protection of video copyright is of vast interest. In this paper, we present a comprehensive approach for protecting and managing video copyrights in the Internet with watermarking techniques. We propose a novel hybrid digital video watermarking scheme with scrambled watermarks and error correction codes. The effectiveness of this scheme is verified through a series of experiments, and the robustness of our approach is demonstrated using the criteria of the latest StirMark test.
Web image learning for searching semantic concepts in image databases.
Without textual descriptions or label information of images, searching semantic concepts in image databases is still a very challenging task. While automatic annotation techniques are yet a long way off, we can seek other alternative techniques to solve this difficult issue. In this paper, we propose to learn Web images for searching the semantic concepts in large image databases. To formulate effective algorithms, we suggest to engage the support vector machines for attacking the problem. We evaluate our algorithm in a large image database and demonstrate the preliminary yet promising results.
Design and Evaluation of a Fault%2DTolerant Mobile%2DAgent System.

Effective Multiresolution Arc Segmentation Algorithms and Performance Evaluation.

The Minimum Error Minimax Probability Machine.
We construct a distribution-free Bayes optimal classifier called the Minimum Error Minimax Probability Machine (MEMPM) in a worst-case setting, i.e., under all possible choices of class-conditional densities with a given mean and covariance matrix. By assuming no specific distributions for the data, our model is thus distinguished from traditional Bayes optimal approaches, where an assumption on the data distribution is a must. This model is extended from the Minimax Probability Machine (MPM), a recently-proposed novel classifier, and is demonstrated to be the general case of MPM. Moreover, it includes another special case named the Biased Minimax Probability Machine, which is appropriate for handling biased classification. One appealing feature of MEMPM is that it contains an explicit performance indicator, i.e., a lower bound on the worst-case accuracy, which is shown to be tighter than that of MPM. We provide conditions under which the worst-case Bayes optimal classifier converges to the Bayes optimal classifier. We demonstrate how to apply a more general statistical framework to estimate model input parameters robustly. We also show how to extend our model to nonlinear classification by exploiting kernelization techniques. A series of experiments on both synthetic data sets and real world benchmark data sets validates our proposition and demonstrates the effectiveness of our model.
A pseudoinverse learning algorithm for feedforward neural networks with stacked generalization applications to software reliability growth data.

Extraction of karyocytes and their components from microscopic bone marrow images based on regional color features.

Analysis of Software Fault Removal Policies Using a Non%2DHomogeneous Continuous Time Markov Chain.

Extendable and Interchangeable Architecture Description of Distributed Systems Using UML and XML.

Domain Testing Based on Character String Predicate.

A Face Processing System Based on Committee Machine The Approach and Experimental Results.
Abstract. In this paper, we propose a heterogeneous committee machine for face processing including face detection and recognition. Our proposed system consists of two components, Face Detection Committee Machine (FDCM) and Face Recognition Committee Machine (FRCM), which employs three and five well-known state-of-the-art approaches respectively. We engage different methodologies to solve the face detection and face recognition problems. We provide a rigorous architecture set-up and experimentation protocol to demonstrate the improved performance of FDCM and FRCM over the individual experts. 1
A Novel Scheme for Video Similarity Detection.
Abstract. In this paper, a new two-phase scheme for video similarity detection is proposed. For each video sequence, we extract two kinds of signatures with different granularities: coarse and fine. Coarse signature is based on the Pyramid Density Histogram (PDH) technique and fine signature is based on the Nearest Feature Trajectory (NFT) technique. In the first phase, most of unrelated video data are filtered out with respect to the similarity measure of the coarse signature. In the second phase, the query video example is compared with the results of the first phase according to the similarity measure of the fine signature. Different from the conventional nearest neighbor comparison, our NFT based similarity measurement method well incorporates the temporal order of video sequences. Experimental results show that our scheme achieves better quality results than the conventional approach. 1
Sensitivity Analysis of Software Reliability for Component%2DBased Software Applications.
The parameters in these software reliability models are usually directly obtained from the field failure data. Due to the dynamic properties of the system and the insufficiency of the failure data, the accurate values of the parameters are hard to determine. Therefore, the sensitivity analysis is often used in this stage to deal with this problem. Sensitivity analysis provides a way to analyzing the impact of the different parameters. In order to assess the reliability of a component-based software, we propose a new approach to analyzing the reliability of the system, based on the reliabilities of the individual components and the architecture of the system. Furthermore, we present the sensitivity analysis on the reliability of a component-based software in order to determine which of the components affects the reliability of the system most. Finally, three general examples are evaluated to validate and show the effectiveness of the proposed approach. 1.

Finite Mixture Model of Bounded Semi%2Dnaive Bayesian Networks Classifier.


A DWT%2DBased Digital Video Watermarking Scheme with Error Correcting Code.
Abstract. In this paper, a digital video watermarking algorithm is proposed. We present a novel DWT-based blind digital video watermarking scheme with scrambled watermark and error correcting code. Our scheme embeds different parts of a single watermark into different scenes of a video under the wavelet domain. To increase robustness of the scheme, the watermark is refined by the error correcting code, while the correcting code is embedded as watermark in audio channel. Our video watermarking algorithm is robust against the attacks of frame dropping, averaging and statistical analysis, which were not solved effectively in the past. Furthermore, it allows blind retrieval of embedded watermark which does not need the original video; and the watermark is perceptually invisible. The algorithm design, evaluation, and experimentation of the proposed scheme are described in this paper. 1.
Message Logging and Recovery in Wireless CORBA Using Access Bridge.
The emerging mobile wireless environment poses exciting challenges for distributed fault tolerant (FT) computing. This paper proposes a message logging and recovery protocol on the top of Telecom Wireless CORBA and FT-CORBA architectures. It uses the storage available at the access bridge as the stable storage to log messages and checkpoints on behalf of a mobile host. Our approach engages both quasi-sender-based and receiver-based logging methods and makes seamless handoff in the presence of failures. The details of how to tolerate mobile host disconnection, mobile host crash and access bridge crash are described. The normalized execution time of a mobile host engaging our proposed scheme and the handoff effect are evaluated.
An Empirical Study on Testing and Fault Tolerance for Software Reliability Engineering.
Software testing and software fault tolerance are two major techniques for developing reliable software systems, yet limited empirical data are available in the literature to evaluate their effectiveness. We conducted a major experiment to engage 34 programming teams to independently develop multiple software versions for an industry-scale critical flight application, and collected faults detected in these program versions. To evaluate the effectiveness of software testing and software fault tolerance, mutants were created by injecting real faults occurred in the development stage. The nature, manifestation, detection, and correlation of these faults were carefully investigated. The results show that coverage testing is generally an effective mean to detecting software faults, but the effectiveness of testing coverage is not equivalent to that of mutation coverage, which is a more truthful indicator of testing quality. We also found that exact faults found among versions are very limited. This result supports software fault tolerance by design diversity as a creditable approach for software reliability engineering. Finally we conducted domain analysis approach for test case generation, and concluded that it is a promising technique for software testing purpose.
A New Software Testing Approach Based on Domain Analysis of Specifications and Programs.

A wireless handheld multi%2Dmodal digital video library client system.
We developed technologies for transmitting video contents over wireless platforms, and encapsulated these video delivery and presentation technologies into a client system for accessing a multimodal digital video library. The mobile access system, iVIEW client, provides a user interface that meets the challenge of rich multi-modal information presentation on wireless hand-held devices. An XML schema is employed to organize the multi-modal metadata for better data interoperability. Furthermore, we investigated a context awareness mechanism complementary to the XML schema to facilitate scalable degradation under restricted resources in wireless application environment. This paper presents the design, implementation, and evaluation of the iVIEW system and its associated technologies for video information management and delivery on pervasive devices over wireless networks. Categories and Subject Descriptors H.5.1 [Information Interfaces and Presentation]: Multimedia Information Systems – evaluation/methodology, hypertext
Character String Predicate Based Automatic Software Test Data Generation.

Performance and Effectiveness Analysis of Checkpointing in Mobile Environments.
Many mathematical models have been proposed to evaluate the execution performance of an application with and without checkpointing in the presence of failures. They assume that the total program execution time without failure is known in advance, under which condition the optimal checkpointing interval can be determined. In mobile environments, application components are distributed and tasks are computed by sending and receiving computational and control messages. The total execution time includes communication time and depends on multiple factors, such as heterogeneous processing speeds, link bandwidth, etc., making it unpredictable during different executions. However, the number of total computational messages received is usually unchanged within an application. Another special factor that should be considered for checkpointing purpose is handoff, which often happens in mobile networks. With these observations, we analyze application execution performance and average effectiveness, and introduce an equinumber checkpointing strategy. We show how checkpointing and handoff affect performance and effectiveness metrics, determine the conditions when checkpointing is beneficial, and calculate the optimal checkpointing interval for minimizing the total execution time and maximizing the average effectiveness in mobile environments.
A Wireless Client for Accessing Multimodal Digital Video Library Systems.

A Unified Scheme of Some Nonhomogenous Poisson Process Models for Software Reliability Estimation.
Abstract—In this paper, we describe how several existing software reliability growth models based on Nonhomogeneous Poisson processes (NHPPs) can be comprehensively derived by applying the concept of weighted arithmetic, weighted geometric, or weighted harmonic mean. Furthermore, based on these three weighted means, we thus propose a more general NHPP model from the quasi arithmetic viewpoint. In addition to the above three means, we formulate a more general transformation that includes a parametric family of power transformations. Under this general framework, we verify the existing NHPP models and derive several new NHPP models. We show that these approaches cover a number of well-known models under different conditions. Index Terms—Software reliability growth model (SRGM), weighted arithmetic mean, weighted geometric mean, weighted harmonic mean, mean value function (MVF), power transformation, nonhomogeneous Poisson process (NHPP). 1
Regularization parameter estimation for feedforward neural networks.
Under the framework of the Kullback-Leibler distance, we show that a particular case of Gaussian probability function for feedforward neural networks reduces into the first order Tikhonov regularizer. The smooth parameter in kernel density estimation plays the role of the regularization parameter. Under some approximations, an estimation formula is derived for estimating regularization parameters based on training data sets. The similarity and difference of the obtained results are compared with other’s work. Experimental results show that the estimation formula works well in the sparse and small training sample cases.
XVIP An XML%2DBased Video Information Processing System.
We describe XVIP, an XML-based video information processing system, which extracts information from video and stores the information in a multimedia digital video library. XVIP encapsulates a number of extraction techniques, including scene change detection, video optical character detection and recognition, and geometric coding. It also provides a seamless approach to scale up the contents created in and delivered by the target multimedia digital video library. Furthermore, XVIP can handle multilingual contents. XVIP is based on a multi-modal concept, which treats each content extraction component as a modality, and users can easily add new modalities into XVIP. The information extracted from the video is then stored in a flexible, scalable and reusable way based on a generic XML structure, providing a convenient mechanism for data representation on Web browsers. Also, the content in the XML file can be used to perform knowledge enrichment on top of the primary information extracted from the video. This enriched data representation helps users search for multimedia video content more efficiently.
Optimal Resource Allocation and Reliability Analysis for Component%2DBased Software Applications.

A new approach for video text detection.

A New Approach for Line Recognition in Large%2Dsize Images Using Hough Transform.

Edge Color Distribution Transform An Efficient Tool for ObjectDetection in Images.

Graphics Recognition from Binary Images One Step or Two Steps.

Optimal Allocation of Testing Resources for Modular Software Systems.
In this paper, based on software reliability growth models with generalized logistic testing-effort function, we study three optimal resource allocation problems in modular software systems during testing phase: 1) minimization of the remaining faults when a fixed amount of testing-effort and a desired reliability objective are given, 2) minimization of the required amount of testing-effort when a specific number of remaining faults and a desired reliability objective are given, and 3) minimization of the cost when the number of remaining faults and a desired reliability objective are given. Several useful optimization algorithms based on the Lagrange multiplier method are proposed and numerical examples are illustrated. Our methodologies provide practical approaches to the optimization of testing-resource allocation with a reliability objective. In addition, we also introduce the testing-resource control problem and compare different resource allocation methods. Finally, we demonstrate how these analytical approaches can be employed in the integration testing. Using the proposed algorithms, project managers can allocate limited testing-resource easily and efficiently and thus achieve the highest reliability objective during software module and integration testing. 1.
A multilingual%2C multimodal digital video library system.

Editorial.
calls &amp; calendarEDITORIAL
Component%2DBased Embedded Software Engineering Development Framework
this  paper, we introduce a component-based embedded software framework and the features  it inherits. We propose a quality assurance (QA) model for component-based embedded  software development, which covers both the component QA and the system QA as well  as their interactions. Furthermore, we propose a generic quality assessment environment  for component-based embedded systems: ComPARE. ComPARE can be used to assess  real-life o#-the-shelf components and to evaluate and validate the models selected for  their evaluation. The overall component-based embedded systems can then be composed  and analyzed seamlessly
A Scalable Mediator System beyond Firewalls using CORBA%2C XML and Java Servlet.

Design and Implementation of XML%2DBased Digital Video Library System.

Tunneling Across Firewalls by using XML and Servlets An Experiment on CORBA.

Integrating digital libraries by CORBA%2C XML and Servlet.

Software Quality Prediction Using Mixture Models with EM Algorithm.
The use of the statistical technique of mixture model analysis as a tool for early prediction of fault-prone program modules is investigated. The Expectation-Maximum likelihood (EM) algorithm is engaged to build the model. By only employing software size and complexity metrics, this technique can be used to develop a model for predicting software quality even without the prior knowledge of the number of faults in the modules. In addition, Akaike Information Criterion (AIC) is used to select the model number, which is assumed to be the class number the program modules should be classified. The technique is successful in classifying software into fault-prone and non fault-prone modules with a relatively low error rate, providing a reliable indicator for software quality prediction. 1
Component%2Dbased software engineering technologies
Component-based software development approach is based on the idea to develop software systems by selecting appropriate of-the-shey components and then to assemble them with a well-defined software architecture. Because the new software development paradigm is much diferent?om the traditional approach, quality assurance (QA) for component-based software development is a new topic in the software engineering community. In this papec we survey current component-based software technologies, describe their advantages and disadvantages, and discuss the features they inherit. We also address QA issues for component-based soffware. As a major contribution, we propose a QA model for component-based software development, which covers component requirement analysis, component development, component certification, component customization, and system architecture design, integration, testing, and maintenance. 1.
SIAS a secure shopping information agent system.
In this paper, we build a Shopping Information Agent System (SIAS) based on mobile agent technology. We discuss possible security attacks by malicious hosts to agents in the system, and present our solutions to prevent these attacks. We analyze the security of our solutions, and evaluate the performance overhead introduced.
Firewall Security Policies%2C Testing and Performance Evaluation.
This paper explores the firewall security and performance relationship for distributed systems. Experiments are conducted to set firewall security into seven different levels and to quantify their performance impacts. These firewall security levels are formulated, designed, implemented, and tested phase by phase under an experimental environment in which all performed tests are evaluated and compared. Based on the test results, the impacts of the various firewall security levels on system performance with respect to transaction time and latency are measured and analyzed. It is interesting to note that the intuitive belief about security to performance, i.e. the more security would result in less performance, does not always hold in the firewall testing. The results reveal that the significant impact from enhanced security on performance could only be observed under some particular scenarios and thus their relationships are not necessarily inversely related. We also discuss the tradeoff between security and performance.
A Phase%2DBased Approach to Creating Highly Reliable Software.

Effort%2DIndex%2DBased Software Reliability Growth Models and Performance Assessment.
In this paper, we first show that the logistic testing-effort function is practically acceptable/helpful for modeling software reliability growth and providing a reasonable description of resource consumption. Therefore, in addition to the exponential-shaped models, we will integrate the logistic testing-effort function into S-shaped model for further analysis. The model is designated as the Yamada Delayed S-shaped model. A realistic failure data set is used in the experiments to demonstrate the estimation procedures and results. Furthermore, the analysis of the proposed model under imperfect debugging environment is investigated. In fact, from these experimental results and discussions, it is apparent that the logistic testing-effort function is well suitable for making estimations of resource consumption during the
ATACOBOL A COBOL Test Coverage Analysis Tool and Its Applications.
A coverage testing tool ATACOBOL (Automatic Test Analysis for COBOL) that applies data flow coverage technique is developed for software development on IBM System/390 mainframe. We show that the data flow coverage criteria can identify possible problematic paths that maps to the actual testing semantic required by Y2K compliance software testing. However, the mainframe environment lacks testing tools that equip the data flow coverage measure. Up to the current implementation, ATACOBOL is able to perform block coverage, decision coverage and all-uses measures. We extend the rules of data flow coverage criteria to adapt data structures that modern high-level languages usually employ. 1.
Quantitative Software Reliability Modeling from Testing to Operation.

Design
Oriented filters are useful in many early vision and image processing tasks. One often needs to apply the same filter, rotated to different angles under adaptive control, or wishes to calculate the filter response at various orientations. We present an efficient architecture to synthesize filters of arbitrary orientations from linear combinations of basis filters, allowing one to adaptively &#034;steer&#034; a filter to any orientation, and to determine analytically the filter output as a function of orientation.
Securing Mobile Agents for Electronic Commerce An Experiment.

Security Modeling and Evaluation for the Mobile Code Paradigm.
this paper, these similarities between security and reliability were observed.
Optimal Software Release Policy Based on Cost and Reliability with Testing Efficiency.

Guest Editor%27s Introduction to the Special Issue on Web Technologies.

Keynote Speech Design Testing and Evaluation Techniques for Software Reliability Engineering.

Reliability%2Doriented software engineering design

Renegotiable Quality of Service %2D A New Scheme for Fault Tolerance in Wireless Networks.
In this paper, we propose the concept that faults in telecommunications networks often manifest themselves as reductions in service quality, which can be addressed by using the notion of Quality of Service (QoS). In wireless ATM networks, the ability to provide QoS guarantees for high priority traffic in the presence of noise or faults is of utmost importance. Moreover, there is a need for renegotiating existing QoS on an established connection, since the characteristics of a wireless link may well change during the lifetime of a connection due to mobile hosts&#039; movements or external interference. In this paper we describe a general QoS strategy as a fault tolerance mechanism, and address the problems associated with providing QoS over a wireless link. We present a QoS scheme with renegotiation capability, define an API (application programming interface) for the access to this scheme and describe our implementation for this QoS API on the SWAN system, a wireless ATM network, and summar...
Incorporating Code Coverage in the Reliability Estimation for Fault%2DTolerant Software.
We present a technique that uses coverage measures in reliability estimation for fault tolerant programs, particularly N-version software. This technique exploits both coverage and time measures collected during testing phases for the individual program versions and the N-version software system for reliability prediction. The application of this technique on the single-version software was presented in our previous research. In this paper we extend this technique and apply it on the N-version programs. The results obtained from the experiment conducted on an industrial project demonstrate that our technique significantly reduces the hazard of reliability overestimation for both single-version and multi-version fault tolerant software systems. 
An empirical study of the correlation between code coverage and reliability estimation.
Existing time-domain models for software reliability often result in an overestimation of such reliability because they do not take the nature of testing techniques into account. Since every testing technique has a limit to its ability to reveal faults in a given system, as a technique approaches its saturation region fewer faults are discovered and reliability growth phenomena are predicted from the models. When the software is turned over to field operation, significant overestimates of reliability are observed. In this paper, we present a technique to solve this problem by addressing both time and coverage measures for the prediction of software failures. Our technique uses coverage information collected during testing to extract only effective data from a given operational profile. Execution time between test cases which neither increase coverage nor cause a failure is reduced by a parameterized factor. Experiments using this technique were conducted on a program created in a simul...
A Generalized Technique for Simulating Software Reliability.

ARMOR Analyzer for Reducing Module Operational Risk.
Component-based software development approach is based on the idea to develop software systems by selecting appropriate off-the-shelf components and then to assemble them with a well-defined software architecture. Because the new software development paradigm is much different from the traditional approach, quality assurance (QA) for component-based software development is a new topic in the software engineering community. In this paper, we survey current component-based software technologies, describe their advantages and disadvantages, and discuss the features they inherit. We also address QA issues for component-based software. As a major contribution, we propose a QA model for component-based software development, which covers component requirement analysis, component development, component certification, component customization, and system architecture design, integration, testing, and maintenance. We also look at the advantages of the Analyzer for Reducing Module Operational Risk (RMOR) tool, and collect some widely adopted Java metrics and tool suites. As our future work we will upgrade ARMOR to windows platformed, off-shelf commercial components based, Java source code oriented risk analysis and evaluation tool.  2  1. 
Achieving Software Quality with Testing Coverage Measures.
This paper discusses the principles of data flow testing, describes a software testing and analysis tool called ATAC, which measures the effectiveness of testing data, and presents two case studies connecting software quality with the control and data flow testing coverage measures: block, decision, c-uses and p-uses. Results from these studies indicate that these measures are useful in uniformly assessing the quality of software testing, in controlling the testing process, and in program understanding. Although programming style can affect test coverage, a quantitative relationship between high testing coverage and program quality is emerging. We suggest practical guidelines in defining high quality software in the light of testing coverage measures.
Some Coupling Measures for C   Programs.
There is a great deal of &#034;hype&#034; about the objectoriented paradigm offering all the solutions to the problems of software engineering. Goals of software engineering like reliability, maintainability, and reusability are said to be more easily achieved using this paradigm, than with traditional ones based on functional decomposition. In order to monitor whether these goals are indeed being achieved, appropriate measures are necessary. Widely used complexity metrics like lines of code, cyclomatic complexity, and Software Science&#039;s metrics may not be appropriate, since they do not address object-oriented concepts like inheritance and encapsulation, apart from having other weaknesses. We consider one attribute of object-oriented software - coupling - and define some measures based in measurement theory. Though these measures have been defined primarily for C++, they could be extended to other object-oriented languages. We then computed the measures for five large (by university standards) C...
Applying Reliability Models More Effectively.

